Homogeneous Optimal Fleet

نویسنده

  • I. GERTSBAKH
چکیده

The structure of chains in the optimal chain decomposition of a periodic schedule S is investigated. A finite oriented graph termed the Linis Graph (LG) is defined which serves as the key for this investigation. The edges of the LG are trip-types of S and the vertices of the LG represent terminals. It is proved that there is an Euler cycle for a connected LG satisfying natural precedence relations between arrival and departure times. Expansion of this cycle in a real time gives a “master-chain” of trips which, being repeated periodically, gives an infinite periodic chain. Time-shifted periodic replication of this chain allows obtaining a group of twin-type periodic chains forming an optimal fleet over S. It is proved that if the LG has m connected components then there is an optimal fleet consisting of m groups of similar periodic chains. It is shown that if the graph of terminals is connected and the LG is disconnected then it is possible to obtain a twin-type fleet over S by adding to S “dummy” trip-types. A general approach to constructing a twin-type fleet of minimal size for this case is described. The relation of the theory developed to the so-called center problem is discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Earthmoving Fleet Size for Minimising Emissions and Cost

Traditionally, the earthmoving operations have been developed based on the minimum cost per production criterion. Nowadays, due to the negative impacts of the emissions on the environment, there is an increasing public awareness to reduce the emissions from the earthmoving operations. Different management strategies can be employed to reduce emissions, amongst other things, which can also resul...

متن کامل

A New Model for Fleet Assignment Problem, Case Study of Iran Air Network at Vision 2036

The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...

متن کامل

An Integrated Approach for Facility Location and Supply Vessel Planning with Time Windows

This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...

متن کامل

A dynamic scheme for stochastic vehicle routing

This paper considers stochastic load-constrained vehicle routing systems in which a fleet of homogeneous vehicles is dispatched from a central depot to serve the demands of surrounding customers. Customer locations and load sizes are known only in distribution before operations. Variants of this problem are often treated with very simple uncoordinated operating schemes, which are mathematically...

متن کامل

Cost Models for Vehicle Routing Problems

Most algorithms for solving vehicle routing problems use the criterion of minimizing total travel time in forming their routes. As illustrated in the paper, even in the case of a homogeneous fleet, solutions using other criteria may be preferred to the solution generated by minimizing total travel time. This situation becomes more pronounced when considering a vehicle routing problem where the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002